Large Neighborhood Search for rich VRP with multiple pickup and delivery locations
نویسندگان
چکیده
In this paper we consider a rich vehicle routing problem where transportation requests are characterised by multiple pickup and delivery locations. The problem is a combined load acceptance and generalised vehicle routing problem incorporating a diversity of practical complexities. Among those are time window restrictions, a heterogeneous vehicle fleet with different travel times, travel costs and capacity, multi-dimensional capacity constraints, order/vehicle compatibility constraints, and different start and end locations for vehicles. We propose iterative improvement approaches based on Large Neighborhood Search and a relatedness measure for transportation requests with multiple pickup and delivery locations. Our algorithms are characterised by very fast response times and thus, can be used within dynamic routing systems where input data can change at any time.
منابع مشابه
An adaptive large neighborhood search with path relinking for a class of vehicle-routing problems with simultaneous pickup and delivery
We study a class of vehicle-routing problems (VRP) with simultaneous pickup and delivery (VRPSPD). In VRPSPDs, each customer may require a certain quantity of goods delivered from the depot and a quantity of goods to be picked up and returned to the depot. Besides the standard VRPSPD, we address (i) the VRPSPD with time limit (VRPSPDTL), which imposes a time limit on the routes of the transport...
متن کاملSolving the Vehicle Routing Problem with Simultaneous Pickup and Delivery by an Effective Ant Colony Optimization
One of the most important extensions of the capacitated vehicle routing problem (CVRP) is the vehicle routing problem with simultaneous pickup and delivery (VRPSPD) where customers require simultaneous delivery and pick-up service. In this paper, we propose an effective ant colony optimization (EACO) which includes insert, swap and 2-Opt moves for solving VRPSPD that is different with common an...
متن کاملAn Adaptive Large Neighborhood Search for the Pickup and Delivery Problem with Transfers
The Pickup and Delivery Problem (PDP) consists in defining a set of routes that satisfy transportation requests between a pickup point and a delivery point. This paper addresses a variant of the PDP where the requests are transportation demands arising from disabled persons. Vehicle passengers can change of vehicle during their trip on specific locations called “transfer points”. Solving this v...
متن کاملScheduling for Transfers in Pickup and Delivery Problems with Very Large Neighborhood Search
In pickup and delivery problems (PDPs), vehicles pickup and deliver a set of items under various constraints. We address the PDP with Transfers (PDP-T), in which vehicles plan to transfer items between one another to form more efficient schedules. We introduce the Very Large Neighborhood Search with Transfers (VLNS-T) algorithm to form schedules for the PDP-T. Our approach allows multiple trans...
متن کاملSingle-Commodity Vehicle Routing Problem with Pickup and Delivery Service
We present a novel variation of the vehicle routing problem VRP . Single commodity cargo with pickup and delivery service is considered. Customers are labeled as either cargo sink or cargo source, depending on their pickup or delivery demand. This problem is called a single commodity vehicle routing problem with pickup and delivery service 1-VRPPD . 1-VRPPD deals with multiple vehicles and is t...
متن کامل